A new method for adaptive IIR filter design based on tabu search algorithm

Adaptive digital filters have proven their worth in a wide range of applications such as channel equalisation, noise reduction, echo cancelling, and system identification. These filters can be broadly classified into two groups: finite impulse–response (FIR) and infinite impulse–response (IIR) filters. IIR filters have become the target of increasing interest because these filters can reduce the filter order significantly as compared to FIR filters. Tabu search is a heuristic optimisation algorithm which has been originally developed for combinatorial optimisation problems. It simulates the general rules of intelligent problem solving and has the ability of discovering the global minima in a multi-modal search space. In this work, a novel method based on tabu search is described for the design of adaptive IIR filters.     

Sphere packing with a geometric based compression algorithm

An efficient algorithm for the random packing of spheres can significantly save the cost of the preparation of an initial configuration often required in discrete element simulations. It is not trivial to generate such random packing at a large scale, particularly when spheres of various sizes and geometric domains of different shapes are present. Motivated by the idea of compression complemented by an efficient physical process to increase packing density, shaking, a new approach, termed compression algorithm, is proposed in this work to randomly fill any arbitrary polyhedral or cylindrical domains with spheres of various sizes. The algorithm features both simplicity and high efficiency. Tests show that it takes 181 s on a 1.4-GHz PC to complete the filling of a cylindrical domain with a total number of 26,787 spheres, achieving a packing density of 52.89%.     

江西省水情计算机网络安全问题的探讨

根据几年来对江西省水情计算机网络管理与维护的经验,提出了关于计算机局域网安全问题一些拙见,仅供水利部门从事相关工作人员参考.     

基于神经网络的智能检索系统

文章首先概述了当前大多数的搜索引擎的主要的弊端；然后着重介绍了智能检索系统的运行基本思路和售用算法，以及该算法在检索领域中运用的优点；最后指出，神经网络运用在检索领域，可解决网络管理中的诸多难题。     

Effects of surrounding brightness on visual search for safety colors

The present article reports the investigation of the effects of surrounding brightness on a visual search for three safety colors: red, orange, and yellow. Images of visual stimuli consisting of an array of colored circles placed on a large visual field (a visual angle of 40°) were displayed on an 80‐in. screen with a DLP projector. Experiment I examined the search efficiency under three levels of background luminance that were equivalent to the three target luminances. The results showed that the search efficiency for the orange target decreased as the number of distractors increased, under each of the background luminance levels, whereas the efficiency scarcely decreased for the red and yellow targets. Although a reduction in background luminance increased the search efficiency for the orange target, it is suggested that the effect of background luminance is smaller than the effect of the target color in search efficiency. Experiment II examined the search efficiency under three conditions of low levels of incident illuminance, which were matched with a linear regression to the luminance of color chips of safety colors measured twilight conditions. The results showed that the search efficiency for the orange target decreased as the number of distractors increased under each of the different illuminance conditions, whereas the efficiency scarcely decreased for red and yellow targets. Furthermore, as illuminance decreased, the search time for the orange target was more greatly impacted than for red or yellow. These results imply that the recognition of orange tends to be influenced by the surrounding brightness. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 400–409, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20152     

一种有效的基于并行量子进化算法的图像边缘检测方法

本文基于费用函数最小化方法,提出一种混合并行量子进化算法用于文本图像的边缘检测。量子进化算法是一种基于量予计算的概念和理论(诸如量子比特和量子叠加态)的进化算法,它采用了量子编码来表征染色体,由于量子比特的概率表示,能够表示出解的线性叠加状态。此外,量子进化算法具有收敛快和好的全局搜索特性,因此它比传统的进化算法更适于并行结构的实现。我们将这一算法和局部搜索算法相结合,用于图像的边缘检测问题,得到了令人满意的检测效果,并对噪声有较好的抑制作用。     

建设屏蔽与非屏蔽局域网的因素

综合布线中的屏蔽与非屏蔽问题 ,在网络布线过程中不可避免地要遇到。目前国际上(欧、美两大阵营之间 )存在着屏蔽系统与非屏蔽系统优劣的争论。针对要不要建设屏蔽局域网的问题 ,从两个方面来加以分析 :一是综合布线中屏蔽的目的、理想与现实的差距、先进性、用户信息及屏蔽与非屏蔽的误区方面 ;二是建设屏蔽局域网的几种因素。     

Vent Location Optimization Using Map-Based Exhaustive Search in Liquid Composite Molding Processes

In liquid composite molding (LCM) processes, the resin is injected into the mold cavity, which contains preplaced reinforcement fabrics, through openings known as gates, while the displaced air leaves the mold through openings called vents. Under nominal conditions, the last points to fill are chosen as vent locations. However, due to imperfect preform cutting and placement, gaps and channels may form along the edges and curvatures in a mold, offering a path with less resistance for resin flow. The faster advance of resin through these gaps and channels, a common disturbance known as racetracking, will cause the last filled regions to vary, which complicates the vent selection process. In this study, probabilistic racetracking modeling is used to capture last-filled region distribution over the mold geometry. Success criteria for mold filling are defined in terms of dry spot tolerances, and vent fitness maps, which display potential vent locations, are created. Next, exhaustive search algorithm is coupled with vent fitness maps to determine optimal vent configurations. The map-based exhaustive search is demonstrated on three geometries and results are compared with existing combinatorial search results. The performance of the optimal vent configurations is evaluated in a virtual manufacturing environment. Sensitivity analyses are conducted to determine the influence of optimization parameters on the results.     

基于ISO质量体系认证在线计量数据智能统计和查询

ISO质量体系认证标准要求对计量数据进行计算和评价。公司的信息管理系统可以自动计算统计参数，并可以方便的进行分析和查询，提高企业工作效率，改善产品质量。论文为国家自然科学基金“现代制造质量控制、溯源中若干理论问题与技术基础的研究”(项目号：59735120)中的一部分。